SIAM Journal on Computing -- 1980

By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

© SIAM

SIAM Journal on Computing

ATTENTION: System maintenance will be performed the weekend of Saturday, March 28, 2009. This event will begin at 6:00 am on March 28 and will conclude at approximately 12:00 noon on Sunday March 29 (all times EDT). Some Scitation services may be affected during this period.

Table of Contents

Available Volumes| Issue Index| View myArticles

Search This Issue

Volume 9, Issue 1, pp. 1-217

Please Note: Electronic articles are available well in advance of the printed articles.

An Efficient Test for Circular-Arc Graphs

pp. 1-24

BibTeX Abstract Full Text: PDF

Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation

Stephen L. Bloom, Calvin C. Elgot, and Jesse B. Wright

pp. 25-45

BibTeX Abstract Full Text: PDF

Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations

Chandra M. R. Kintala and Patrick C. Fischer

pp. 46-53

BibTeX Abstract Full Text: PDF

On the Complexity of Composition and Generalized Composition of Power Series

R. P. Brent and J. F. Traub

pp. 54-66

BibTeX Abstract Full Text: PDF

The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment

M. C. B. Hennessy

pp. 67-84

BibTeX Abstract Full Text: PDF

On the Optimality of Linear Merge

Paul K. Stockmeyer and F. Frances Yao

pp. 85-90

BibTeX Abstract Full Text: PDF

Bounds for List Schedules on Uniform Processors

Yookun Cho and Sartaj Sahni

pp. 91-103

BibTeX Abstract Full Text: PDF

Worst Case Exponential Lower Bounds for Input Resolution with Paramodulation

pp. 104-110

BibTeX Abstract Full Text: PDF

An Efficient Method for Weighted Sampling without Replacement

C. K. Wong and M. C. Easton

pp. 111-113

BibTeX Abstract Full Text: PDF

On the Succinctness of Different Representations of Languages

pp. 114-120

BibTeX Abstract Full Text: PDF

Addition Chain Methods for the Evaluation of Specific Polynomials

David Dobkin and Richard J. Lipton

pp. 121-125

BibTeX Abstract Full Text: PDF

On the Complexity of Searching a Set of Vectors

D. S. Hirschberg

pp. 126-129

BibTeX Abstract Full Text: PDF

Combinatorial Gray Codes

J. T. Joichi, Dennis E. White, and S. G. Williamson

pp. 130-141

BibTeX Abstract Full Text: PDF

A Note on Gray Code and Odd-Even Merge

P. Flajolet and Lyle Ramshaw

pp. 142-158

BibTeX Abstract Full Text: PDF

Monoids for Rapid Data Flow Analysis

pp. 159-196

BibTeX Abstract Full Text: PDF

Finding the Vertex Connectivity of Graphs

pp. 197-199

BibTeX Abstract Full Text: PDF

Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with $2$-Dimensional Storage Applications

D. T. Lee and C. K. Wong

pp. 200-211

BibTeX Abstract Full Text: PDF

On the Complexity of Canonical Labeling of Strongly Regular Graphs

pp. 212-216

BibTeX Abstract Full Text: PDF

Corrigendum. A New Representation of the Rational Numbers for Fast Easy Arithmetic

E. C. R. Hehner and R. N. S. Horspool

p. 217

BibTeX Abstract Full Text: PDF